Mining Non- Redundant Frequent Pattern in Taxonomy Datasets using Concept Lattices
نویسنده
چکیده
In general frequent itemsets are generated from large data sets by applying various association rule mining algorithms, these produce many redundant frequent itemsets. In this paper we proposed a new framework for Non-redundant frequent itemset generation using closed frequent itemsets without lose of information on Taxonomy Datasets using concept lattices. General Terms Frequent Pattern, Association Rules, Lattices.
منابع مشابه
Iceberg Query Lattices for Datalog
In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension from a propositional representation to datalog, and the second is the condensed representation of frequent itemsets by means of Formal Concept Analysis (FCA). We combine the notion of frequent datalog queries with ice...
متن کاملMax-FTP: Mining Maximal Fault-Tolerant Frequent Patterns from Databases
Mining Fault-Tolerant (FT) Frequent Patterns in real world (dirty) databases is considered to be a fruitful direction for future data mining research. In last couple of years a number of different algorithms have been proposed on the basis of Apriori-FT frequent pattern mining concept. The main limitation of these existing FT frequent pattern mining algorithms is that, they try to find all FT f...
متن کاملMining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient thanmining frequent itemsets for generating non-redundant association rules. The task is challenging in data stream environment because of the unbounded nature and no-second-look characteristics. In this paper, we propose an algorithm, CLICI, for mining all recent closed itemsets in landmark window model of online data strea...
متن کاملDiscovering Non-Redundant Association Rules using MinMax Approximation Rules
Dept. Of Comp. Sci. & Eng. Vaagdevi college of Eng. Warangal, India [email protected] Abstract Frequent pattern mining is an important area of data mining used to generate the Association Rules. The extracted Frequent Patterns quality is a big concern, as it generates huge sets of rules and many of them are redundant. Mining Non-Redundant Frequent patterns is a big concern in the area of Ass...
متن کاملREAFUM: Representative Approximate Frequent Subgraph Mining
Noisy graph data and pattern variations are two thorny problems faced by mining frequent subgraphs. Traditional exact-matching based methods, however, only generate patterns that have enough perfect matches in the graph database. As a result, a pattern may either remain undetected or be reported as multiple (almost identical) patterns if it manifests slightly different instances in different gr...
متن کامل